A Grassmannian Graph Approach to Affine Invariant Feature Matching
نویسندگان
چکیده
منابع مشابه
A Grassmannian Graph Approach to Affine Invariant Feature Matching
In this work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure that is capable of robustly recovering correspondences between two unorganized, affinely related feature (point) sets. The first stage maps the feature sets...
متن کاملThe Affine Grassmannian
The affine Grassmannian is an important object that comes up when one studies moduli spaces of the form BunG(X), where X is an algebraic curve and G is an algebraic group. There is a sense in which it describes the local geometry of such moduli spaces. I’ll describe the affine Grassmannian as a moduli space, and construct it concretely for some concrete groups. References, including the constru...
متن کاملA Feature Matching Algorithm Based on an Illumination and Affine Invariant for Aerial Image Registration
This paper presents a new feature matching algorithm for registering aerial images with large illumination distortion, similar patterns, affine transformation and low overlapping areas. In this algorithm, affine invariant regions are obtained by a K-NN graph and its corresponding adjacent graph. Then an illumination and affine invariant called Illumination Invariant MultiScale Autoconvolution (...
متن کاملA Resilient Image Matching Method with an Affine Invariant Feature Detector and Descriptor
Image feature matching is to seek, localize and identify the similarities across the images. The matched local features between different images can indicate the similarities of their content. Resilience of image feature matching to large view point changes is challenging for a lot of applications such as 3D object reconstruction, object recognition and navigation, etc, which need accurate and ...
متن کاملImage Segment Matching Using Affine- Invariant Regions
In this paper, a method for matching image segments using triangle-based (geometrical) regions is proposed. Triangular regions are formed from triples of vertex points obtained from a keypoint detector (SIFT). However, triangle regions are subject to noise and distortion around the edges and vertices (especially acute angles). Therefore, these triangles are expanded into parallelogramshaped reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2020
ISSN: 1057-7149,1941-0042
DOI: 10.1109/tip.2019.2959722